منابع مشابه
BPS black holes , quantum attractor flows and automorphic forms
Murat Gunaydin, Andrew Neitzke, Boris Pioline, 4 and Andrew Waldron Department of Physics, Penn State University, University Park, PA 16802, USA School of Natural Sciences, Institute for Advanced Study, Princeton, NJ 08540, USA LPTHE, Universités Paris VI & VII, Jussieu, 75252 Paris, FRANCE LPTENS, Département de Physique de l’ENS, 24, rue Lhomond, 75005 Paris, FRANCE Department of Mathematics,...
متن کاملStrange attractor simulated on a quantum computer
Starting from the work of Lorenz [1], it has been realized that the dynamics of many various dissipative systems converges to so-called strange attractors [2]. These objects are characterized by fractal dimensions and chaotic unstable dynamics of individual trajectories. They appear in nature in very different contexts, including applications to turbulence and weather forecast [1,2], molecular ...
متن کاملSymmetric Time-Reversible Flows with a Strange Attractor
A symmetric chaotic flow is time-reversible if the equations governing the flow are unchanged under the transformation t → −t except for a change in sign of one or more of the state space variables. The most obvious solution is symmetric and the same in both forward and reversed time and thus cannot be dissipative. However, it is possible for the symmetry of the solution to be broken, resulting...
متن کاملQuantum Flows for Secret Key Distribution
In practice, the security of a Quantum Key Distribution (QKD) system relies not only on quantum mechanical principles, but it also significantly relies on the physical implementation of the protocol. Nowadays, technological detector loopholes of QKD systems have been demonstrated, and some successful attacks that exploit vulnerabilities of the Avalanche Photo Diodes (APD’s) have been performed....
متن کاملQuantum Algorithms for Matching and Network Flows
We present quantum algorithms for the following graph problems: finding a maximal bipartite matching in time O(n √ m + n log n), finding a maximal non-bipartite matching in time O(n( √ m/n+ log n) log n), and finding a maximal flow in an integer network in time O(min(n √ m · U, √ nUm) log n), where n is the number of vertices, m is the number of edges, and U ≤ n is an upper bound on the capacit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2007
ISSN: 1029-8479
DOI: 10.1088/1126-6708/2007/09/056